A Multiple Lattice Reduction Based Detector for Space Time Block Codes Based on Cyclotomic Extensions
نویسندگان
چکیده
Full diversity high-rate Space Time Block Codes (STBCs) based on cyclotomic field extensions Q(ωl), where ωl is the complex lth root of unity, can be decoded by Lenstra-Lenstra-Lovász (LLL) lattice reduction-aided linear equalization followed by appropriate zero forcing. LLL lattice reduction-aided linear equalization enables lower complexity decoding compared to sphere decoding, while resulting in a performance loss. In this paper, we propose a new suboptimal detection algorithm which exploits the algebraic structure of this class of STBCs and applies LLL lattice reduction-based detection multiple times on the received space-time symbol to arrive at an estimate of the transmitted codeword matrix. The decoding complexity is still significantly lower than sphere decoding complexity. Using simulations, the proposed scheme is shown to perform better than the conventional LLL reductionbased scheme in terms of bit error rate. We also point out that the computational effort for the multiple lattice reductionbased scheme can be significantly reduced for codes over certain numbers of transmit antennas.
منابع مشابه
Trace-Orthonormal Full-Diversity Cyclotomic Space-Time Codes
In this paper, we consider the design of full diversity space-time codes for a coherent MIMO communication system. Starting from both the information theoretic and detection error viewpoints, we first establish that a desirable property for general linear dispersion (LD) codes is to have an inter-unitary as well as an intra-unitary structure – a structure we call traceorthonormality. By imposin...
متن کاملOptimal STBC over PSK signal sets from cyclotomic field extensions
An n l (l n) space time block code (STBC) C over a complex signal set S consists of a finite number of n l matrices with elements from S. For quasi-static, flat fading channels a primary performance index of C is the minimum of the rank of the difference of any two matrices, called the rank of the code. C is of full rank if its rank is n and is of minimum delay if l = n. The rate R, in bits per...
متن کاملFull-diversity, high-rate space-time block codes from division algebras
We present some general techniques for constructing full-rank, minimal-delay, rate at least one space–time block codes (STBCs) over a variety of signal sets for arbitrary number of transmit antennas using commutative division algebras (field extensions) as well as using noncommutative division algebras of the rational field embedded in matrix rings. The first half of the paper deals with constr...
متن کاملPolynomial Time Reduction from Approximate Shortest Vector Problem to Principal Ideal Problem for Lattices in Some Cyclotomic Rings
Many cryptographic schemes have been established based on the hardness of lattice problems. For the asymptotic efficiency, ideal lattices in the ring of cyclotomic integers are suggested to be used in most such schemes. On the other hand in computational algebraic number theory one of the main problem is the principal ideal problem (PIP). Its goal is to find a generator of any principal ideal i...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006